Secret Image Sharing for General Access Structures using Random Grids
نویسندگان
چکیده
This paper presents a visual secret sharing (VSS) scheme for general access structures by using random grids. Compared to the existing VSS schemes for general access structures, the proposed scheme generates the shares of same size as that of the original secret image and does not require any codebook prior to encryption process. With these advantages, the proposed scheme broadens the potential applicability of random-grid based VSS. We prove that the proposed scheme gives the strong access structure. Formal proofs, security analysis and experimental results are given to demonstrate both the feasibility and the correctness of the proposed scheme.
منابع مشابه
Multiple Image Encryption using Random Circular Grids and Recursive Image Hiding
The visual secret sharing (VSS) scheme encrypts the secret information into various meaningless shares. These shares are distributed to the authorized participants and the secret information can be retrieved by any k out of n participants by stacking their respective shares on top of each other. This scheme uses HVS (Human Visual System) to decrypt the information, and thus no technical or fina...
متن کاملA 2 out of 3 Visual Multiple Secret Sharing Method using Generalized Random Grids
Visual secret sharing by using generalized random grids is a novel approach for generating nonexpansible shares by artfully utilizing various random variables. Stacking the shares together, secret image can be revealed. This paper proposes a 2 out of 3 visual multiple secret sharing method using generalized random grids. Three secret images (A, B, C) are used for generating three non-expansible...
متن کاملImproving Contrast in Random Grids Based Visual Secret Sharing
In the existing random grids based (n, n) visual secret sharing (VSS) schemes, decryption is done with the help of human visual system by stacking the cipher grids. The stacking operation is computationally modeled as Boolean OR operation, which suffers from two drawbacks. Firstly, the contrast of the reconstructed image decreases exponentially by increasing n (≥2) and secondly, it requires per...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملAn Extended Visual Cryptography Algorithm for Quality-Improved Gray Scale Image with Sigmoid Function
Conventional visual secret sharing schemes generate noise-like random pixels on shares to hide secret images. It suffers amanagement problem, because of which dealers cannot visually identify each share. This problem is solved by the extended visual cryptography scheme (EVCS), which adds ameaningful cover image in each share. However, the previous approaches involving the EVCS for general acces...
متن کامل